On Some Diophantine Equations (i)
نویسندگان
چکیده
In this paper we study the equation m−n = py,where p is a prime natural number, p≥ 3. Using the above result, we study the equations x + 6pxy + py = z and the equations ck(x 4 + 6pxy + py) + 4pdk(x y + pxy) = z, where the prime number p ∈ {3, 7, 11, 19} and (ck, dk) is a solution of the Pell equation, either of the form c −pd = 1 or of the form c − pd = −1. I. Preliminaries. We recall some necessary results. Proposition 1.1. ([3],p.74)The integer solutions of the Diophantine equation x1 + x 2 2 + ... + x 2 k = x 2 k+1 are the following ones x1 = ±(m1 + m2 + ... + mk−1 −mk) x2 = 2m1mk ..................... ..................... xk = 2mk−1mk xk+1 = ±(m1 + m2 + ... + mk−1 + mk), with m1, ..., mk integer numbers. From the geometrical point of view, the solutions (x1, x2, ..., xk, xk+1) are the sizes x1, x2, ..., xk of a right hyper-parallelipiped in the space R and xk+1 is the length of its diagonal. Proposition 1.2. ([1], p.150) The quadratic field Q( √ d), where d ∈ N∗ , d is square free, has an Euclidean ring of integers A (with respect to the norm N), for d ∈ {2, 3, 5, 6, 7, 11, 13, 17, 19, 21, 29, 33, 37, 41, 57, 73} .
منابع مشابه
A Generalized Fibonacci Sequence and the Diophantine Equations $x^2pm kxy-y^2pm x=0$
In this paper some properties of a generalization of Fibonacci sequence are investigated. Then we solve the Diophantine equations $x^2pmkxy-y^2pm x=0$, where $k$ is positive integer, and describe the structure of solutions.
متن کاملDiophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملInteger Solutions of Some Diophantine Equations via Fibonacci and Lucas Numbers
We study the problem of finding all integer solutions of the Diophantine equations x2 − 5Fnxy − 5 (−1) y2 = ±Ln, x2 − Lnxy + (−1) y2 = ±5F 2 n , and x2 − Lnxy + (−1) y2 = ±F 2 n . Using these equations, we also explore all integer solutions of some other Diophantine equations.
متن کاملDiophantine Equations after Fermat’s Last Theorem
These are expository notes that accompany my talk at the 25th Journées Arithmétiques, July 2–6, 2007, Edinburgh, Scotland. I aim to shed light on the following two questions: (i) Given a Diophantine equation, what information can be obtained by following the strategy of Wiles’ proof of Fermat’s Last Theorem? (ii) Is it useful to combine this approach with traditional approaches to Diophantine e...
متن کاملParametric solutions for some Diophantine equations
Under some hypotheses we show that the Diophantine equation (1) has infinitely many solutions described by a family depending on k + 2 parameters. Some applications of the main result are given and some special equations are studied.
متن کاملDiophantine Equations Involving Arithmetic Functions of Factorials
DIOPHANTINE EQUATIONS INVOLVING ARITHMETIC FUNCTIONS OF FACTORIALS Daniel M. Baczkowski We examine and classify the solutions to certain Diophantine equations involving factorials and some well known arithmetic functions. F. Luca has showed that there are finitely many solutions to the equation:
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004